An algorithm of finding rules for a class of cellular automata

Cellular automata (CA) is an important modelling paradigm for complex systems. In the design of cellular automata, most difficult task to find transformation rules that describe temporal evolution or pattern a modelled system. A CA with weights(CAW) yields transition algorithm proposed in this paper, which have ample physical meanings and extend category CA. Firstly, weights are increased connect updated cell its neighbours, output each depends on states cells neighbourhood their respective weights. Secondly, error correction adopted correct by adjusting When zero, required will be found fixed configuration. The CAW relax configuration regardless initial states. Finally, mathematical analysis simulation carried out one-dimensional CAW, results show has ability as converges exponentially.